TSTP Solution File: NLP265^18 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NLP265^18 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:03:30 EDT 2024
% Result : Theorem 0.19s 0.36s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 31
% Syntax : Number of formulae : 64 ( 31 unt; 26 typ; 0 def)
% Number of atoms : 178 ( 32 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 236 ( 7 ~; 2 |; 0 &; 197 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 23 usr; 11 con; 0-3 aty)
% ( 11 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 56 ( 40 ^ 15 !; 0 ?; 56 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mindex: $tType ).
thf(type_def_6,type,
mworld: $tType ).
thf(func_def_0,type,
mworld: $tType ).
thf(func_def_1,type,
mindex: $tType ).
thf(func_def_2,type,
mrel: mindex > mworld > mworld > $o ).
thf(func_def_3,type,
'#i_alice': mindex ).
thf(func_def_4,type,
'#i_bob': mindex ).
thf(func_def_5,type,
'#b_alice': mindex ).
thf(func_def_6,type,
'#b_bob': mindex ).
thf(func_def_7,type,
mactual: mworld ).
thf(func_def_8,type,
mlocal: ( mworld > $o ) > $o ).
thf(func_def_10,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(func_def_11,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_12,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_13,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_14,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_15,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(func_def_16,type,
mdia: mindex > ( mworld > $o ) > mworld > $o ).
thf(func_def_18,type,
bigcity: $i > mworld > $o ).
thf(func_def_19,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_35,type,
sK1: mworld > mworld ).
thf(func_def_36,type,
sK2: mworld > mworld ).
thf(func_def_37,type,
sK3: mworld ).
thf(func_def_38,type,
sK4: mworld ).
thf(func_def_39,type,
sK5: mworld > mworld ).
thf(func_def_40,type,
sK6: mworld > mworld ).
thf(f156,plain,
$false,
inference(trivial_inequality_removal,[],[f154]) ).
thf(f154,plain,
$false = $true,
inference(superposition,[],[f150,f113]) ).
thf(f113,plain,
( ( bigcity @ portland @ sK4 )
= $false ),
inference(binary_proxy_clausification,[],[f112]) ).
thf(f112,plain,
( $false
= ( ( mrel @ '#b_bob' @ sK3 @ sK4 )
=> ( bigcity @ portland @ sK4 ) ) ),
inference(beta_eta_normalization,[],[f111]) ).
thf(f111,plain,
( $false
= ( ^ [Y0: mworld] :
( ( mrel @ '#b_bob' @ sK3 @ Y0 )
=> ( bigcity @ portland @ Y0 ) )
@ sK4 ) ),
inference(sigma_clausification,[],[f109]) ).
thf(f109,plain,
( $false
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_bob' @ sK3 @ Y0 )
=> ( bigcity @ portland @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f108]) ).
thf(f108,plain,
( $false
= ( ( mrel @ '#i_alice' @ mactual @ sK3 )
=> ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_bob' @ sK3 @ Y0 )
=> ( bigcity @ portland @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f107]) ).
thf(f107,plain,
( $false
= ( ^ [Y0: mworld] :
( ( mrel @ '#i_alice' @ mactual @ Y0 )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ '#b_bob' @ Y0 @ Y1 )
=> ( bigcity @ portland @ Y1 ) ) ) )
@ sK3 ) ),
inference(sigma_clausification,[],[f106]) ).
thf(f106,plain,
( $true
!= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#i_alice' @ mactual @ Y0 )
=> ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ '#b_bob' @ Y0 @ Y1 )
=> ( bigcity @ portland @ Y1 ) ) ) ) ) ),
inference(beta_eta_normalization,[],[f73]) ).
thf(f73,plain,
( $true
!= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#i_alice'
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_bob'
@ ( bigcity @ portland ) ) ) ) ),
inference(definition_unfolding,[],[f62,f65,f61,f61]) ).
thf(f61,plain,
( mbox
= ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f44,plain,
( mbox
= ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f43]) ).
thf(f43,plain,
( ( ^ [X0: mindex,X1: mworld > $o,X2: mworld] :
! [X3: mworld] :
( ( mrel @ X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) )
= mbox ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
( ( ^ [X4: mindex,X0: mworld > $o,X2: mworld] :
! [X5: mworld] :
( ( mrel @ X4 @ X2 @ X5 )
=> ( X0 @ X5 ) ) )
= mbox ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(f65,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(cnf_transformation,[],[f34]) ).
thf(f34,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f1,axiom,
( mlocal
= ( ^ [X0: mworld > $o] : ( X0 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(f62,plain,
( ( mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f53]) ).
thf(f53,plain,
( ( mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) )
!= $true ),
inference(flattening,[],[f23]) ).
thf(f23,plain,
( ( mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) )
!= $true ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
~ ( mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) ),
inference(rectify,[],[f18]) ).
thf(f18,negated_conjecture,
~ ( mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) ),
inference(negated_conjecture,[],[f17]) ).
thf(f17,conjecture,
mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f150,plain,
! [X0: mworld] :
( $true
= ( bigcity @ portland @ X0 ) ),
inference(trivial_inequality_removal,[],[f149]) ).
thf(f149,plain,
! [X0: mworld] :
( ( $false = $true )
| ( $true
= ( bigcity @ portland @ X0 ) ) ),
inference(superposition,[],[f56,f139]) ).
thf(f139,plain,
! [X1: mworld] :
( ( $false
= ( mrel @ '#b_alice' @ mactual @ X1 ) )
| ( $true
= ( bigcity @ portland @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f138]) ).
thf(f138,plain,
! [X1: mworld] :
( $true
= ( ( mrel @ '#b_alice' @ mactual @ X1 )
=> ( bigcity @ portland @ X1 ) ) ),
inference(beta_eta_normalization,[],[f137]) ).
thf(f137,plain,
! [X1: mworld] :
( $true
= ( ^ [Y0: mworld] :
( ( mrel @ '#b_alice' @ mactual @ Y0 )
=> ( bigcity @ portland @ Y0 ) )
@ X1 ) ),
inference(pi_clausification,[],[f136]) ).
thf(f136,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_alice' @ mactual @ Y0 )
=> ( bigcity @ portland @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f74]) ).
thf(f74,plain,
( $true
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_alice'
@ ( bigcity @ portland ) ) ) ),
inference(definition_unfolding,[],[f66,f65,f61]) ).
thf(f66,plain,
( ( mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) )
= $true ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
( ( mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) )
= $true ),
inference(fool_elimination,[],[f35]) ).
thf(f35,plain,
mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ),
inference(rectify,[],[f15]) ).
thf(f15,axiom,
mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
thf(f56,plain,
! [X0: mworld,X1: mworld] :
( $true
= ( mrel @ '#b_alice' @ X0 @ X1 ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f40,plain,
! [X0: mworld,X1: mworld] :
( $true
= ( mrel @ '#b_alice' @ X0 @ X1 ) ),
inference(fool_elimination,[],[f39]) ).
thf(f39,plain,
! [X0: mworld,X1: mworld] : ( mrel @ '#b_alice' @ X0 @ X1 ),
inference(rectify,[],[f11]) ).
thf(f11,axiom,
! [X2: mworld,X5: mworld] : ( mrel @ '#b_alice' @ X2 @ X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','mrel_#b_alice_universal') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NLP265^18 : TPTP v8.2.0. Released v8.1.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 21:55:07 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TH0_THM_EQU_NAR problem
% 0.12/0.33 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.35 % (31345)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.35 % (31348)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.35 % (31349)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.35 % (31347)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.19/0.35 % (31346)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.35 % (31343)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.19/0.35 % (31344)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.19/0.35 % (31342)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.19/0.35 % (31345)Instruction limit reached!
% 0.19/0.35 % (31345)------------------------------
% 0.19/0.35 % (31345)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35 % (31345)Termination reason: Unknown
% 0.19/0.35 % (31345)Termination phase: shuffling
% 0.19/0.35
% 0.19/0.35 % (31346)Instruction limit reached!
% 0.19/0.35 % (31346)------------------------------
% 0.19/0.35 % (31346)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35 % (31345)Memory used [KB]: 895
% 0.19/0.35 % (31345)Time elapsed: 0.003 s
% 0.19/0.35 % (31345)Instructions burned: 2 (million)
% 0.19/0.35 % (31345)------------------------------
% 0.19/0.35 % (31345)------------------------------
% 0.19/0.35 % (31346)Termination reason: Unknown
% 0.19/0.35 % (31346)Termination phase: Property scanning
% 0.19/0.35
% 0.19/0.35 % (31346)Memory used [KB]: 1023
% 0.19/0.35 % (31346)Time elapsed: 0.003 s
% 0.19/0.35 % (31346)Instructions burned: 2 (million)
% 0.19/0.35 % (31346)------------------------------
% 0.19/0.35 % (31346)------------------------------
% 0.19/0.35 % (31349)Instruction limit reached!
% 0.19/0.35 % (31349)------------------------------
% 0.19/0.35 % (31349)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35 % (31349)Termination reason: Unknown
% 0.19/0.35 % (31349)Termination phase: Property scanning
% 0.19/0.35
% 0.19/0.35 % (31349)Memory used [KB]: 1023
% 0.19/0.35 % (31349)Time elapsed: 0.003 s
% 0.19/0.35 % (31349)Instructions burned: 3 (million)
% 0.19/0.35 % (31349)------------------------------
% 0.19/0.35 % (31349)------------------------------
% 0.19/0.35 % (31343)Instruction limit reached!
% 0.19/0.35 % (31343)------------------------------
% 0.19/0.35 % (31343)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35 % (31343)Termination reason: Unknown
% 0.19/0.35 % (31343)Termination phase: Function definition elimination
% 0.19/0.35
% 0.19/0.35 % (31343)Memory used [KB]: 1023
% 0.19/0.35 % (31343)Time elapsed: 0.004 s
% 0.19/0.35 % (31343)Instructions burned: 4 (million)
% 0.19/0.35 % (31343)------------------------------
% 0.19/0.35 % (31343)------------------------------
% 0.19/0.35 % (31347)Refutation not found, incomplete strategy
% 0.19/0.35 % (31347)------------------------------
% 0.19/0.35 % (31347)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35 % (31347)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.35
% 0.19/0.35
% 0.19/0.35 % (31347)Memory used [KB]: 5500
% 0.19/0.35 % (31347)Time elapsed: 0.004 s
% 0.19/0.35 % (31347)Instructions burned: 4 (million)
% 0.19/0.35 % (31347)------------------------------
% 0.19/0.35 % (31347)------------------------------
% 0.19/0.36 % (31344)First to succeed.
% 0.19/0.36 % (31342)Also succeeded, but the first one will report.
% 0.19/0.36 % (31344)Refutation found. Thanks to Tanya!
% 0.19/0.36 % SZS status Theorem for theBenchmark
% 0.19/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.36 % (31344)------------------------------
% 0.19/0.36 % (31344)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (31344)Termination reason: Refutation
% 0.19/0.36
% 0.19/0.36 % (31344)Memory used [KB]: 5628
% 0.19/0.36 % (31344)Time elapsed: 0.011 s
% 0.19/0.36 % (31344)Instructions burned: 13 (million)
% 0.19/0.36 % (31344)------------------------------
% 0.19/0.36 % (31344)------------------------------
% 0.19/0.36 % (31341)Success in time 0.013 s
% 0.19/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------